class Solution {
    public int searchInsert(int[] nums, int target) {
        int left = 0;
        int right = nums.length - 1;
        int mid = (left+right)/2;
        while(left<=right) {
            if(nums[mid]<target) {
                System.out.println("a");
                left = mid+1;
            }else if(nums[mid]>target) {
                right = mid-1;
            } else {
                return mid;
            }
            mid = (left+right)/2; 
        }
        return left;
    }
}